Enumerating Perfect Forms
نویسنده
چکیده
A positive definite quadratic form is called perfect, if it is uniquely determined by its arithmetical minimum and the integral vectors attaining it. In this self-contained survey we explain how to enumerate perfect forms in d variables up to arithmetical equivalence and scaling. We put an emphasis on practical issues concerning computer assisted enumerations. For the necessary theory of Voronoi we provide complete proofs based on Ryshkov polyhedra. This allows a very natural generalization to T -perfect forms, which are perfect with respect to a linear subspace T in the space of quadratic forms. Important examples include Gaussian, Eisenstein and Hurwitz quaternionic perfect forms, for which we present new classification results in dimensions 8, 10 and 12.
منابع مشابه
Redundancy and its forms in the last third of the Holy Quran
Recognizing the rhetoric sciences plays an important role in understanding facetiae and minutes of the Qur'an. One of the subdirectories of the semantics is "brevity, redundant and equality" that has long been of interest to scholars of rhetoric, so that some scholar experts have been confined rhetoric to this discussion. Therefore in enumerating types of brevity, redundant and equality differe...
متن کاملA Fast Algorithm for Enumerating Bipartite Perfect Matchings
In this paper, we propose an algorithm for enumerating all the perfect matchings included in a given bipartite graph G = (V,E). The algorithm is improved by the approach which we proposed at ISAAC98. Our algorithm takes O(log |V |) time per perfect matching while the current fastest algorithm takes O(|V |) time per perfect matching. Keyword: enumeration, enumerating algorithm, perfect matching.
متن کاملGraphical condensation of plane graphs: A combinatorial approach
The method of graphical vertex-condensation for enumerating perfect matchings of plane bipartite graph was found by Propp (Theoret. Comput. Sci. 303(2003), 267-301), and was generalized by Kuo (Theoret. Comput. Sci. 319 (2004), 29-57) and Yan and Zhang (J. Combin. Theory Ser. A, 110(2005), 113125). In this paper, by a purely combinatorial method some explicit identities on graphical vertex-cond...
متن کاملAlgorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs
For a bipartite graph G = (V, E), (1) perfect, (2) maximum and (3) maximal matchings are matchings (1) such that all vertices are incident to some matching edges, (2) whose cardinalities are maximum among all matchings, (3) which are contained in no other matching. In this paper, we present three algorithms for enumerating these three types of matchings. Their time complexities are O(|V |) per ...
متن کاملGraphical condensation for enumerating perfect matchings
The method of graphical condensation for enumerating perfect matchings was found by Propp (Theoretical Computer Science 303(2003), 267-301), and was generalized by Kuo (Theoretical Computer Science 319 (2004), 29-57). In this paper, we obtain some more general results on graphical condensation than Kuo’s. Our method is also different from Kuo’s. As applications of our results, we obtain a new p...
متن کامل